#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=200050;
int read(){
    int f=1;int m=0;char c=getchar();
    while((c<'0'||c>'9')){if(c=='-')f=-1;c=getchar();}
    while(!(c<'0'||c>'9')){m=m*10+(c-'0');c=getchar();}
    return m*f;
}
int n;
int r[maxn];
queue<int> s;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    n=read();
    for(int i=1;i<=n;i++){
        r[i]=read();
    }
    sort(r+1,r+n+1);
    s.push(r[1]);
    for(int i=2;i<=n;i++){
        if(s.front()<r[i])s.pop();
        s.push(r[i]);
    }
    cout<<s.size()<<'\n';
    return 0;
}